Do Isomorphic Structural Matrix Rings Have Isomorphic Graphs?

نویسندگان

  • S. DǍSCǍLESCU
  • L. VAN WYK
چکیده

We first provide an example of a ring R such that all possible 2 × 2 structural matrix rings over R are isomorphic. However, we prove that the underlying graphs of any two isomorphic structural matrix rings over a semiprime Noetherian ring are isomorphic, i.e. the underlying Boolean matrix B of a structural matrix ring M(B,R) over a semiprime Noetherian ring R can be recovered, contrary to the fact that in general R cannot be recovered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On zero-divisor graphs of quotient rings and complemented zero-divisor graphs

For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...

متن کامل

Isomorphism of Generalized Triangular Matrix-rings and Recovery of Tiles

Matrix-rings play a fundamental role in mathematics and its applications. A difficult question is to decide whether a given ring is isomorphic to a matrixring or one of its variants. Several “hidden matrix-rings” have been shown in the literature (see [5]). These rings did not appear as being matrix-rings at the first sight, nevertheless they proved out to be isomorphic to matrix-rings. Another...

متن کامل

Isomorphism of a Fuzzy Graph Using Fuzzy Matrix Equality

In this study we discuss about an application of fuzzy graph isomorphism. If we look two unequal fuzzy matrices on undirected fuzzy graphs, we cannot say either the fuzzy graphs of theses fuzzy matrices are isomorphic or not isomorphic. It is because two fuzzy matrices may look different even if the fuzzy graphs are isomorphic. In this study, by using the algorithm for fuzzy graph isomorphism i...

متن کامل

Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs

A graph G is pseudo 2–factor isomorphic if the parity of the number of cycles in a 2–factor is the same for all 2–factors ofG. In [3] we proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2–factor isomorphic graphs and we prove th...

متن کامل

On Twin--Good Rings

In this paper, we investigate various kinds of extensions of twin-good rings. Moreover, we prove that every element of an abelian neat ring R is twin-good if and only if R has no factor ring isomorphic to‌ Z2  or Z3. The main result of [24] states some conditions that any right self-injective ring R is twin-good. We extend this result to any regular Baer ring R by proving that every elemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996